منابع مشابه
Edge-coloring Vertex-weightings of Graphs
Let $G=(V(G),E(G))$ be a simple, finite and undirected graph of order $n$. A $k$-vertex weightings of a graph $G$ is a mapping $w: V(G) to {1, ldots, k}$. A $k$-vertex weighting induces an edge labeling $f_w: E(G) to N$ such that $f_w(uv)=w(u)+w(v)$. Such a labeling is called an {it edge-coloring k-vertex weightings} if $f_{w}(e)not= f_{w}(echr(chr(chr('39')39chr('39'))39chr(chr('39')39chr('39'...
متن کاملFrom Edge-Coloring to Strong Edge-Coloring
In this paper we study a generalization of both proper edge-coloring and strong edge-coloring: k-intersection edge-coloring, introduced by Muthu, Narayanan and Subramanian [18]. In this coloring, the set S(v) of colors used by edges incident to a vertex v does not intersect S(u) on more than k colors when u and v are adjacent. We provide some sharp upper and lower bounds for χk-int for several ...
متن کاملThree edge-coloring conjectures
The focus of this article is on three of the author’s open conjectures. The article itself surveys results relating to the conjectures and shows where the conjectures are known to hold.
متن کاملEdge Coloring with Delays
Consider the following communication problem, that leads to a new notion of edge coloring. The communication network is represented by a bipartite multigraph, where the nodes on one side are the transmitters and the nodes on the other side are the receivers. The edges correspond to messages, and every edge e is associated with an integer c(e), corresponding to the time it takes the message to r...
متن کاملSoft Edge Coloring
We consider a variant of edge coloring problem, which arises in multichannel wireless networks. We are given a graph , and constraint for each , which is the number of colors that edges incident to can use. In addition, we have a constraint on the number of colors available in the network (denoted as ). For a pair of edges incident to a vertex, they are said to be conflicting if the colors assi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1996
ISSN: 0012-365X
DOI: 10.1016/0012-365x(94)00254-g